Unipotent diagonalization of matrices

نویسندگان

چکیده

An element $u$ of a ring $R$ is called \textsl{unipotent} if $u-1$ is
 nilpotent. Two elements $a,b\in R$ are \textsl{unipotent equivalent}
 there exist unipotents $p,q\in such that $b=q^{-1}ap$. square
 matrices $A,B$ \textsl{strongly unipotent equivalent} there
 triangular $P,Q$ with $B=Q^{-1}AP$.
 In this paper, over commutative reduced rings, we characterize the matrices
 which strongly equivalent to diagonal matrices. For $2\times 2$
 B\'{e}zout domains, nilpotent some multiples $E_{12}$ and nontrivial
 idempotents $E_{11}$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonalization of Sp(2) matrices

The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two Wigner matrix, derivable from Wigner’s little group which dictates the internal space-time symmetries of relativistic particles. The Wigner matrix can be diagon...

متن کامل

Quantum Diagonalization of Hermitean Matrices

To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource. It allows one, in principle, to diagonalize hermitean (N × N) matrices by quantum mechanical measurements only. To do so, one considers the given matrix as an observable of a single spin wit...

متن کامل

Routines for the diagonalization of complex matrices

This note describes a set of routines for the eigenvalue decomposition, singular value decomposition, and Takagi factorization of a complex matrix. Unlike many other implementations, the current ones are all based on the Jacobi algorithm, which makes the code very compact but suitable only for small to medium-sized problems. Although distributed as a library, the routines are self-contained and...

متن کامل

Unipotent Jacobian Matrices and Univalent Maps

The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for C maps is explored here. Some results known in the polynomial case are extended to the C context, and some special cases are resolved.

متن کامل

Block Diagonalization of Nearly Diagonal Matrices

In this paper we study the effect of block diagonalization of a nearly diagonal matrix by iterating the related Riccati equations. We show that the iteration is fast, if a matrix is diagonally dominant or scaled diagonally dominant and the block partition follows an appropriately defined spectral gap. We also show that both kinds of diagonal dominance are not destroyed after the block diagonali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Electronic Journal of Algebra

سال: 2023

ISSN: ['1306-6048']

DOI: https://doi.org/10.24330/ieja.1281654